Strategies for Specifying Relations ∗
نویسندگان
چکیده
The generation perspective taken by optimality theoretic syntax has a lot in common with the insights gained in natural language generation. This paper explores how insights about NP generation (e.g. Reiter & Dale (2000), van Deemter (2004)) can be made fruitful for explaining the semantics and pragmatics of sentences with more than one plural NP by exploiting optimality theoretic pragmatics, as well as the list construction in discourse grammar. Though this is an exploration only (anaphora is completely neglected and no attempt is made at covering the lexicon), I would claim to show here: 1. the naturalness of the cumulative readings, 2. how the different quantificational schemata arise, 3. how exhaustivity implicatures arise, 4. how differential implicatures arise, 5. how to disambiguate double plural sentences. 1 How to specify relations A normal natural language generation task is to specify a relation, given as a set of sequences of objects, as computed e.g. by a relational database.1 One of the subtasks here is to construct singular referential expressions. It is customary in NL generation to have preferences for the kind of NP employed. This is an example statement of the preferences, meant to be correct for Dutch and extended from Reiter & Dale (2000). (1) first and second person pronouns > reflexives > 3rd person pronoun> deictic pronouns> anaphoric definites and short names > full demonstrative NPs > full descriptions and full names > indefinites > generics ∗In partial fulfillment of a promise I made to Kjell-Johan to specify all my prejudices about topics. 1It is certainly no accident that the pioneering PHLIQA project in the 1970’s, an NL interface with a relational database, was the context for the work reported in Scha (1981) and Scha (1983).
منابع مشابه
Dependences in Strategy Logic
Strategy Logic (SL) is a very expressive logic for specifying and verifying properties of multi-agent systems: in SL, one can quantify over strategies, assign them to agents, and express properties of the resulting plays. Such a powerful framework has two drawbacks: first, model checking SL has non-elementary complexity; second, the exact semantics of SL is rather intricate, and may not corresp...
متن کاملPVS Strategies for Proving Abstraction Properties of Automata
Abstractions are important in specifying and proving properties of complex systems. To prove that a given automaton implements an abstract specification automaton, one must first find the correct abstraction relation between the states of the automata, and then show that this relation is preserved by all corresponding action sequences of the two automata. This paper describes tool support based...
متن کاملThe Investigation on the Relations between Epistemological Beliefs and Self-Regulating Learning Strategies among Students in North Khorasan University of Medical Sciences in 2017
Introduction: Poor epistemological beliefs are among the reasons which will lead a person to tiredness, lack of motivation and distrust to personal abilities. This is usually resulted from the fact that individuals with such beliefs image the knowledge as unrelated and confusing elements which surrounded by references and they will never try for learning it. In the recent years, there are high ...
متن کاملDependencies in Strategy Logic∗
Strategy Logic (SL) is a very expressive logic for expressing and verifying properties of multi-agent systems: in SL, one can quantify over strategies, assign them to agents, and express properties of the resulting plays. Such a powerful framework has two drawbacks: first, model checking SL has non-elementary complexity; second, the exact semantics of SL is rather intricate, and may not corresp...
متن کاملSimulation of Timed Input/Output Automata
This proposal describes the design of the TIOA Simulator, a vital component of the TIOA Project, which aims to provide a framework for designing and implementing dependable distributed systems. The project is based on the Timed Input/Output Automaton framework, and supports TIOA, a formal language for specifying Timed I/O Automata. Simulation of TIOA can be used to test the proposed model and f...
متن کامل